Efficient Distributed Workload (Re-)Embedding
نویسندگان
چکیده
منابع مشابه
Re-embedding words
We present a fast method for re-purposing existing semantic word vectors to improve performance in a supervised task. Recently, with an increase in computing resources, it became possible to learn rich word embeddings from massive amounts of unlabeled data. However, some methods take days or weeks to learn good embeddings, and some are notoriously difficult to train. We propose a method that ta...
متن کاملEfficient Algorithms for t-distributed Stochastic Neighborhood Embedding
Abstract. t-distributed Stochastic Neighborhood Embedding (t-SNE) is a method for dimensionality reduction and visualization that has become widely popular in recent years. Efficient implementations of t-SNE are available, but they scale poorly to datasets with hundreds of thousands to millions of high dimensional data-points. We present Fast Fourier Transformaccelerated Interpolation-based t-S...
متن کاملWorkload minimization in re-entrant lines
This paper is concerned with workload minimization in re-entrant lines with exponential service times and preemptive control policies. Using a numerical algorithm called the power series algorithm we obtain nearly optimal policies for systems with up to 8 queues. We also improve considerably the implementation of the power series algorithm.
متن کاملDistributed Virtual Network Embedding
The Internet in its current form is considered to be inflexible and difficult to change. Though a number of innovations and improvements (like DiffServ/IntServ, IPv6, ...) have been proposed, the actual architecture of the Internet has experienced a very slow adoption of new ideas. Network virtualization has been recognized as a tool to overcome this perceived ossification [1, 2]. Network virtu...
متن کاملNear-Optimal Distributed Tree Embedding
Tree embeddings are a powerful tool in the area of graph approximation algorithms. Roughly speaking, they transform problems on general graphs into much easier ones on trees. Fakcharoenphol, Rao, and Talwar (FRT) [STOC’04] present a probabilistic tree embedding that transforms n-node metrics into (probability distributions over) trees, while stretching each pairwise distance by at most anO(log ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Measurement and Analysis of Computing Systems
سال: 2019
ISSN: 2476-1249
DOI: 10.1145/3322205.3311084